Communicating Formal Proofs: The Case of Flyspeck

نویسندگان

  • Carst Tankink
  • Cezary Kaliszyk
  • Josef Urban
  • Herman Geuvers
چکیده

We introduce a platform for presenting and cross-linking formal and informal proof developments together. The platform supports writing natural language ‘narratives’ that include islands of formal text. The formal text contains hyperlinks and gives on-demand state information for each proof step. We argue that such a system significantly lowers the threshold for understanding formal development and facilitates collaboration on informal and formal parts of large developments. As an example, we show the Flyspeck formal development (in HOL Light) and the Flyspeck informal mathematical text as a narrative linked to the formal development. To make this possible, we use the Agora system, a MathWiki platform developed at Nijmegen which has so far mainly been used with the Coq theorem prover: we show that the system itself is generic and easily adapted to the HOL Light case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Introduction to the Flyspeck Project

This article gives an introduction to a long-term project called Flyspeck, whose purpose is to give a formal verification of the Kepler Conjecture. The Kepler Conjecture asserts that the density of a packing of equal radius balls in three dimensions cannot exceed π/ √ 18. The original proof of the Kepler Conjecture, from 1998, relies extensively on computer calculations. Because the proof relie...

متن کامل

Learning-assisted theorem proving with millions of lemmas☆

Large formal mathematical libraries consist of millions of atomic inference steps that give rise to a corresponding number of proved statements (lemmas). Analogously to the informal mathematical practice, only a tiny fraction of such statements is named and re-used in later proofs by formal mathematicians. In this work, we suggest and implement criteria defining the estimated usefulness of the ...

متن کامل

Flyspeck I: Tame Graphs

We present a verified enumeration of tame graphs as defined in Hales’ proof of the Kepler Conjecture and confirm the completeness of Hales’ list of all tame graphs while reducing it from 5128 to 2771 graphs.

متن کامل

Automated Reasoning Service for HOL Light

HOL(y)Hammer is an AI/ATP service for formal (computerunderstandable) mathematics encoded in the HOL Light system, in particular for the users of the large Flyspeck library. The service uses several automated reasoning systems combined with several premise selection methods trained on previous Flyspeck proofs, to attack a new conjecture that uses the concepts defined in the Flyspeck library. Th...

متن کامل

Formal Mathematics on Display: A Wiki for Flyspeck

The Agora system is a prototype “Wiki for Formal Mathematics”, with an aim to support developing and documenting large formalizations of mathematics in a proof assistant. The functions implemented in Agora include in-browser editing, strong AI/ATP proof advice, verification, and HTML rendering. The HTML rendering contains hyperlinks and provides on-demand explanation of the proof state for each...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013